Distributed SMC-PHD Fusion for Partial, Arithmetic Average Consensus
نویسنده
چکیده
We propose an average consensus approach for distributed SMC-PHD (sequential Monte Carlo-probability hypothesis density) fusion, in which local filters extract Gaussian mixtures (GMs) from their respective particle posteriors, share them (iteratively) with their neighbors and finally use the disseminated GM to update the particle weight. The resulting particle distribution is the arithmetic average of the disseminated GM-posteriors. There are two distinguishable features of our approach compared to exiting approaches. First, a computationally efficient particles-to-GM (P2GM) conversion scheme is developed based on the unique structure of the SMC-PHD updater in which the particle weight can be exactly decomposed with regard to the measurements and misdetection. Only significant components of higher weight are utilized for parameterization and so the disseminated information is only a part of that of local posteriors. The consensus, conditioned on partial information dissemination over the network, is called “partial consensus”. Second, importance sampling (IS) is employed to re-weight the local particles for integrating the received GM information, without changing the states of the particles. By this, the local prior PHD and likelihood calculation can be carried out in parallel to the dissemination & fusion procedure. To assess the effectiveness of the proposed P2GM parameterization approach and IS approach, two relevant yet new distributed SMC-PHD fusion protocols are introduced for comparison. One uses the same P2GM conversion and GM dissemination schemes as our approach but local particles are regenerated from the disseminated GMs at each filtering iteration in place of the IS approach. This performs similar to our IS approach (as expected) but prevents any parallelization as addressed above. The other is disseminating the particles between neighbors in place of the P2GM conversion. This avoids parameterization but is communicatively costly. This protocol, essentially seeking complete (posterior) consensus, however, does not perform better than the GM-dissemination based partial consensus. Different to these arithmetic average consensus approaches, the state-of-theart exponential mixture density approach that seeks geometric average consensus is also realized for comparison.
منابع مشابه
Partial Consensus and Conservative Fusion of Gaussian Mixtures for Distributed PHD Fusion
We propose a novel consensus notion, called “partial consensus”, for distributed GM-PHD (Gaussian mixture probability hypothesis density) fusion based on a peer-to-peer (P2P) sensor network, in which only highly-weighted posterior Gaussian components (GCs) are disseminated in the P2P communication for fusion while the insignificant GCs are not involved. The partial consensus does not only enjoy...
متن کاملBox-Particle PHD Filter for Multi-Target Tracking
This paper develops a novel approach for multitarget tracking, called box-particle probability hypothesis density filter (box-PHD filter). The approach is able to track multiple targets and estimates the unknown number of targets. Furthermore, it is capable to deal with three sources of uncertainty: stochastic, set-theoretic and data association uncertainty. The box-PHD filter reduces the numbe...
متن کاملHigh-level Information Fusion for Constrained SMC Methods and Applications
Information Fusion is a field that studies processes utilizing data from various input sources, and techniques exploiting this data to produce estimates and knowledge about objects and situations. On the other hand, human computation is a new and evolving research area that uses human intelligence to solve computational problems that are beyond the scope of existing artificial intelligence algo...
متن کاملUW CENTER FOR PATTERN ANALYSIS AND MACHINE INTELLIGENCE GRADUATE SEMINAR SERIES Distributed Random Finite Set Theoretic Soft/Hard Data Fusion: Target Tracking Application
The development of data fusion systems capable of incorporating soft humangenerated data into the fusion process is an emerging trend in the fusion community, motivated mainly by asymmetric warfare situations where the observational opportunities for traditional hard sensors are restricted. This paper describes an extension of our prototype soft/hard data fusion system, based on RFS theory, fro...
متن کاملDistributed Map Merging in a Robotic Network
Abstract— The map merging problem in a robotic network consists of the construction of a global map of the environment using the partial (local) maps individually acquired by the robots. We build on ideas from distributed sensor fusion to provide an algorithmic solution to the map merging problem that uses the local maps as sensor measurements. We use a distributed average consensus algorithm t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1712.06128 شماره
صفحات -
تاریخ انتشار 2017